Non-preemptive dispatching and locking policies

Optimal Policies for Multi-server Non-preemptive Priority Queues

We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of ex...

Preemptive and Non-Preemptive Generalized Min Sum Set Cover

In the (non-preemptive) Generalized Min Sum Set Cover Problem, we are given n ground elements and a collection of sets S = {S1, S2, ..., Sm} where each set Si ∈ 2 has a positive requirement κ(Si) that has to be fulfilled. We would like to order all elements to minimize the total (weighted) cover time of all sets. The cover time of a set Si is defined as the first index j in the ordering such th...

Linear programming based algorithms for preemptive and non-preemptive RCPSP

In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable is associated to a subset of independent activities (antichains). The properties of the model are first investigated. In particular, conditions are given that allow a solution of the linear program to be a feasible sched...

Acceptance and Dispatching Policies for a Distribution Problem

A dynamic and stochastic distribution problem with a number of terminals and a eet of vehicles is analyzed. Customers request the transportation of batches of loads between diierent origins and destinations. A request can be accepted or rejected; if the request is accepted, a reward is received. Holding costs for vehicles and loads at terminals as well as transportation costs are included in th...

Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling